Two New Quorum Based Algorithms for Distributed Mutual Exclusion
نویسندگان
چکیده
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of quorums is approximately p 2 p N where N is the number of sites in a network, as compared to 2 p N of the original method. The method is simple and geometrically evident. The second one is based on the idea of di erence sets in combinatorial theory. The resulting scheme is very close to optimal in terms of quorum size.
منابع مشابه
A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Torus Quorum Protocol for Distributed Mutual Exclusion
Designing efficient and fault-tolerant algorithms for solving the mutual exclusion problem is an important issue in distributed systems. Many algorithms have been proposed in the literature, and they are being broadly classified into two types: token-based and permissionbased [5, 21]. In a token-based algorithm, the system uses a unique token to represent the privilege for the node possessing i...
متن کاملQuorum-Based Mutual Exclusion Algorithms: A Survey
The development of highly complex software, communication interfaces and the presence of low-cost processors are key factors towards the design of distributed applications. By distributing a computation, processes are permitted to run concurrently, share resources among themselves and at the same time working independent of each other. Distributed computations that involve sharing of resources ...
متن کاملTwo New Quorum Based Algorithms for
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modiication of Maekawa's grid based quorum scheme. The size of quorums is approximately p 2 p N where N is the number of sites in a network, as compared to 2 p N of the original method. The method is simple and geometrically evident. The second one is based on the idea of diierence set...
متن کامل